Classical groups
Finite groups
Group schemes
Topological groups
Lie groups
Super-Lie groups
Higher groups
Cohomology and Extensions
Related concepts
The term class equation (or class formula, or orbit decomposition formula) refers to a basic type of counting argument that comes about by decomposing a finite G-set as a union of its orbits. This has a number of fundamental applications in group theory.
Let be a group and let be a G-set (given by a homomorphism of monoids, with which is associated an action ). Recall that is connected in the category of G-sets if is inhabited and the action is transitive; in this case, choosing an element , there is a surjection of -sets sending , and this induces an isomorphism where is the stabilizer of and is the -set consisting of left cosets of .
More generally, each -set admits a canonical decomposition as a coproduct of its connected components; the components are usually called the orbits of the action. Choosing a representative element in each orbit , this means we have an isomorphism of -sets
By taking and to be finite and counting elements, we get an equation of the form
This is sometimes called Burnside’s lemma, Burnside’s counting theorem, the Cauchy–Frobenius lemma, or the orbit-counting theorem. Here we shall call an instance of this equation a class equation. By judicious choice of groups and -sets , often in combination with number-theoretic arguments, one can derive many useful consequences; some sample applications are given below.
Notice that reading the class equation equivalently as
it expresses the groupoid cardinality of the action groupoid of acting on .
Let be a prime; recall that a -group is a finite group whose order is a power of . A basic structural result is the following.
A non-trivial -group has a nontrivial center .
Let act on itself by the conjugation action , . In this case an orbit is usually called the conjugacy class of , and is trivial (consists of exactly one element ) iff belongs to . In any case divides , and therefore divides if is noncentral. In this case the class equation takes the form
and now since divides as well as each term in the sum over nontrivial orbits, it must also divide . In particular, has more than one element.
It follows by induction that -groups are solvable, since the center is a normal subgroup and the quotient is also a -group. Since a group obtained from an abelian group by repeated central extensions is nilpotent, -groups are in fact nilpotent.
An elementary observation that is frequently useful is that the number of fixed points of an involution on a finite set has the same parity as . This is a statement about -sets; we generalize this to a statement about -sets for general -groups . (Again, a fixed point of a -set is an element whose orbit is a singleton.)
If is a -group acting on a set , then
As special cases, if there is just one fixed point, then , and if divides , then divides .
The class equation takes the form
where divides each summand over nontrivial orbits on the right, since is a -group. Now reduce mod .
In the theory of finite projective planes, an important result is that a projective plane is Pappian if it is Desarguesian. The purely algebraic version of this is Wedderburn’s theorem:
A finite division ring is commutative.
(Witt) The center of is a field; if is of characteristic , then the center has elements for some . We may regard as an -vector space of dimension , whence the number of elements of its multiplicative group is .
The conjugation action of on itself yields a decomposition
where again the elements of the center correspond to the trivial orbits. The stabilizer of any , together with , forms a division ring (strictly) intermediate between and ; usually this is called the centralizer of . Putting , the division ring has elements, and notice divides because is just the dimension of seen as a vector space (module) over . Thus , and we have a class equation
Now let be any primitive root of unity. Since divides each polynomial and , so does . It follows that the algebraic integer divides each of the integers and , and hence divides according to the class equation. But also for any root of unity . Thus and , i.e., is all of as was to be shown.
Let be a finite group of order , and suppose that is a prime that divides ; say where does not divide . Recall that a Sylow p-subgroup is a -subgroup of maximal order .
A fundamental fact of group theory is that Sylow -subgroups exist and they are all conjugate to one another; also the number of Sylow -subgroups is .
Existence of Sylow -subgroups can be proven by exploiting the same type of argument as in the proof of Proposition :
If has order and is a prime power dividing , then there is a subgroup of of order .
First we show that Sylow subgroups exist. We start by observing that if a group has a -Sylow subgroup , then so does any subgroup . To prove this, first note that if we let act on by left translation, then the stabilizer of any element is , a -group since is. Then note that since has cardinality prime to , so must one of its connected components in its -set decomposition
and this makes a -Sylow subgroup of .
Then, if is of order , apply this observation to the embedding
where we embed the symmetric group via permutation matrices into the group of invertible matrices over . The group has order , with maximal -factor . It thus has a -Sylow subgroup given by unitriangular matrices, i.e., upper-triangular matrices with all 's on the diagonal. Therefore -Sylow subgroups exist for any finite group .
Finally, note that by Proposition , is solvable and therefore has a composition series
where each has order .
If is a -subgroup of and is a Sylow -subgroup, then for some . In particular, all Sylow -subgroups are conjugate to one another.
acts on the set of cosets as usual by left translation, and we may restrict the action to the -subgroup . By maximality of , we see is prime to , and so by Proposition , is also prime to . In particular, has at least one element, say . We infer that for all , or that for all , and this implies that .
The number of Sylow -subgroups of is .
Let be the set of Sylow -subgroups; acts on by conjugation. As all Sylow -subgroups are conjugate, there is just one orbit of the action, and the stabilizer of an element is just the normalizer (by definition of normalizer). Thus as -sets.
Restrict the action to the subgroup . Of course the element is a fixed point of this restricted action, and if is any other fixed point, it means for all , whence . Now: are both Sylow -subgroups of and are therefore conjugate to each other (as seen within the group ). But is already fixed by the conjugation action in its stabilizer , so we conclude . We conclude has exactly one element. From (Proposition ), the theorem follows.
If is a group of order where is prime to , then the number of -Sylow subgroups divides .
Because acts transitively on -Sylow subgroups (Theorem ) , the number divides . From Theorem , we have for some integers . Since divides both terms of the left side of , it divides .
The Sylow theorems are routinely used throughout group theory. As a sample application: if are distinct primes, with and , then any group of order is abelian. (For example, a group of order must be commutative.)
We have by Corollary , but (using Theorem and ), so . Arguing similarly we have but and , so . The -Sylow subgroup of order and the -Sylow subgroup of order are both abelian. since are relatively prime, and are normal subgroups of since are both . It follows that is a subgroup of order , hence . Thus to prove abelian, it suffices to show that if and , then and commute, i.e., . But by normality of , the element belongs to ; similarly, the element belongs to , and so . The result follows.
For more see
Last revised on December 20, 2024 at 00:31:18. See the history of this page for a list of all contributions to it.